Composition of Low-Error 2-Query PCPs Using Decodable PCPs
نویسندگان
چکیده
منابع مشابه
Small PCPs With Low Query
Most known constructions of probabilistically checkable proofs (PCPs) either blow up the proofsize by a large polynomial, or have a high (though constant) query complexity. In this thesis we give a transformation with slightly-super-cubic blowup in proof-size and a low query complexity. Specifically, the verifier probes the proof in 16 bits and rejects every proof of a false assertion with prob...
متن کاملRobust PCPs of Proximity and Shorter PCPs
Probabilistically Checkable Proofs (PCPs) provide a format of rewriting and verifyingmathematical proofs that allow efficient probabilistic verification based on probing very few bits of the rewritten proof. The celebrated PCP Theorem asserts that probing a constant number of bits suffices (in fact just 3 bits suffice). A natural question that arises in the construction of PCPs is by how much d...
متن کاملLecture 5 : PCPs of Proximity , Proof Composition
In today’s lecture we will first define a new variant of PCP, called PCPs of Proximity, and then use this we use to perform ”proof composition”, a necessary ingredient in all existing PCP constructions to reduce the size of the alphabet or equivalently to reduce the query complexity. In fact, proof composition will be one of the phases of Dinur’s proof of the PCP, that we will discuss in the ne...
متن کاملShort PCPs with Polylog Query Complexity
We give constructions of probabilistically checkable proofs (PCPs) of length n · polylog n proving satisfiability of circuits of size n that can verified by querying polylog n bits of the proof. We also give analogous constructions of locally testable codes (LTCs) mapping n information bits to n · polylog n bit long codewords that are testable with polylog n queries. Our constructions rely on n...
متن کاملQuery Efficient PCPs with Perfect Completeness
For every integer k > 0, and an arbitrarily small constant ε > 0, we present a PCP characterization of NP where the verifier uses logarithmic randomness, non-adaptively queries 4k + k2 bits in the proof, accepts a correct proof with probability 1, i. e., it has perfect completeness, and accepts any supposed proof of a false statement with probability at most 2−k 2 + ε . In particular, the verif...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Computing
سال: 2013
ISSN: 0097-5397,1095-7111
DOI: 10.1137/100788161